DIAGNOSIS OF HEART DISEASE USING AUTOMATA FINITE STATE ALGORITHM
نویسندگان
چکیده
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملDiagnosis of Heart Disease Using Binary Grasshopper Optimization Algorithm and K-Nearest Neighbors
Introduction: The heart is one of the main organs of the human body, and its unhealthiness is an important factor in human mortality. Heart disease may be asymptomatic, but medical tests can predict and diagnose it. Diagnosis of heart disease requires extensive experience of specialist physicians. The aim of this study is to help physicians diagnose heart disease based on hybrid Binary Grasshop...
متن کاملDiagnosis Of Heart Disease Using Datamining Algorithm
The diagnosis of heart disease is a significant and tedious task in medicine. The healthcare industry gathers enormous amounts of heart disease data that regrettably, are not “mined” to determine concealed information for effective decision making by healthcare practitioners. The term Heart disease encompasses the diverse diseases that affect the heart. Cardiomyopathy and Cardiovascular disease...
متن کاملA Genetic Algorithm for Finite State Automata
The genetic algorithm is described, including its three main steps: selection, crossover, and mutation. A comparison between implementation costs and running times of regular expressions matching a string is then made. The aim of this paper is to describe and analyze the behavior of an implementation of a non-deterministic finite-state acceptor using a genetic algorithm.
متن کاملImage Representation Using Finite State Automata
Image representation using quadtrees is useful in many applications and is well known in computer graphics. It has been shown that we can represent quadtrees asrationallanguages that are recognizable by finite state automata (FSA) [1]. These FSA can use less memory and are more flexible than their corresponding quadtrees. Binary image representation using FSA follows these two main steps: (1) F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Techno Nusa Mandiri
سال: 2021
ISSN: 2527-676X,1978-2136
DOI: 10.33480/techno.v18i1.1364